On the Predictability of Classical Propositional Logic

On the Predictability of Classical Propositional Logic

In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction, that opposes considering Boolean Logic as trivial in any sense. For that, we study the predictability of classical logic, which we take to be ...

Notes on Classical Propositional Logic

tascpl: TAS Solver for Classical Propositional Logic

We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas in negation normal form. This new representation allows for a better description of the reduction strategies, in that considers only those occurrences of literals which are relevant for the satisfiability of the input form...

Combining intermediate propositional logics with classical logic

In [17], we introduced a modal logic, called L, which combines intuitionistic propositional logic IPC and classical propositional logic CPC and is complete w.r.t. an algebraic semantics. However, L seems to be too weak for Kripke-style semantics. In this paper, we add positive and negative introspection and show that the resulting logic L5 has a Kripke semantics. For intermediate logics I , we ...

Naming Proofs in Classical Propositional Logic

We present a theory of proof denotations in classical propositional logic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. With the Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentialization theorem, and a strongly normalizing cut-elimination procedure. This gives us a “Boolean” cat...